Polymorphic arrays: a novel VLSI layout for systolic computersFIAT, A; ADI SHAMIR.Journal of computer and system sciences (Print). 1986, Vol 33, Num 1, pp 47-65, issn 0022-0000Article

How to expose an eavesdropperRIVEST, R. L; ADI SHAMIR.Communications of the ACM. 1984, Vol 27, Num 4, pp 393-395, issn 0001-0782Article

Multi-oracle interactive protocols with constant space verifiersFEIGE, U; ADI SHAMIR.Journal of computer and system sciences (Print). 1992, Vol 44, Num 2, pp 259-271, issn 0022-0000Article

A LINEAR TIME ALGORITHM FOR FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHSADI SHAMIR.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 645-655; BIBL. 7 REF.Article

FACTORING NUMBERS IN O(LOG N) ARITHMETIC STEPSADI SHAMIR.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 1; PP. 28-31; BIBL. 5 REF.Article

HOW TO SHARE A SECRETADI SHAMIR.1979; COMMUNIC. A.C.M.; USA; DA. 1979; VOL. 22; NO 11; PP. 612-613; BIBL. 5 REF.Article

ON THE SECURITY OF THE MERKLE-HELLMAN CRYPTOGRAPHIC SCHEMEADI SHAMIR; ZIPPEL RE.1980; I.E.E.E. TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 3; PP. 339-340; BIBL. 5 REF.Article

A T=O(2^N/2), S=O(2^N/4) ALGORITHM FOR CERTAIN NP-COMPLETE PROBLEMSSCHROEPPEL R; ADI SHAMIR.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 456-464; BIBL. 6 REF.Article

A T-S²=O(2^N) TIME/SPACE TRADEOFF FOR CERTAIN NP-COMPLETE PROBLEMSSCHROEPPEL R; ADI SHAMIR.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SICENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 328-336; BIBL. 7 REF.Conference Paper

THE CONVERGENCE OF FUNCTIONS TO FIXED POINTS OF RECURSIVE DEFINITIONS.MANNA Z; ADI SHAMIR.1978; THEOR. COMPUTER SCI.; NETHERL.; DA. 1978; VOL. 6; NO 2; PP. 109-141; BIBL. 13 REF.Article